Convexity cuts for multiple choice problems
نویسندگان
چکیده
منابع مشابه
Improved Convexity Cuts for Lattice Point Problems
The generalized lattice point (GLF) problem provides a formulation that accommodates a var.lety of discrete alternative problems. In this paper we show how to substantlrlly strengthen the convexity cuts for the GLF problem. The new cuts are based on the identification of "synthesized" lattice point conditions to replace those that ordinarily define the cut. The synthesized conditions give an al...
متن کاملDepth-Optimized Convexity Cuts
This paper presents a general, self-contained treatment of convexity or intersection cuts. It describes two equivalent ways of generating a cut — via a convex set or a concave function — and a notion of strong cuts. We then characterize the structure of the sets and functions that generate strong cuts. We then specialize the framework to the case of mixed-integer linear programming (MIP). For t...
متن کاملConvexity Problems on Meshes with Multiple Broadcasting
The purpose of this work is to present simple time-optimal algorithms for a number of convexity-related problems on meshes with multiple broadcasting. More speciically, we show that with an n-vertex convex polygon P as input, the tasks of computing the perimeter , the area, the diameter, the width, the modality, the smallest-area enclosing rectangle, and the largest-area inscribed triangle shar...
متن کاملGenetic Algorithms for Multiple-Choice Optimisation Problems
This thesis investigates the use of problem-specific knowledge to enhance a genetic algorithm approach to multiple-choice optimisation problems.It shows that such information can significantly enhance performance, but that the choice of information and the way it is included are important factors for success.Two multiple-choice problems are considered.The first is constructing a feasible nurse ...
متن کاملA Decentralized Heuristic for Multiple-Choice Combinatorial Optimization Problems
We present a decentralized heuristic applicable to multi-agent systems (MAS), which is able to solve multiple-choice combinatorial optimization problems (MC-COP). First, the MC-COP problem class is introduced and subsequently a mapping to MAS is shown, in which each class of elements in MC-COP corresponds to a single agent in MAS. The proposed heuristic ”COHDA” is described in detail, including...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1973
ISSN: 0012-365X
DOI: 10.1016/0012-365x(73)90095-2